Finite-time scaling via linear driving
نویسندگان
چکیده
منابع مشابه
On Linear Scaling via Interference Alignment at Finite SNR
Real Interference Alignment, proposed in the literature by Motahari et. al., achieves the maximal degrees of freedom (d.o.f.) for the time-invariant K-user Gaussian interference channel (K-GIC). With the surprising result that, for almost all realizations of the static channel, each user can support half the interference free rate in the high SNR limit, it is not clear whether each user can be ...
متن کاملOptimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملAMinimumActionMethodwithOptimal Linear Time Scaling
In this work, we develop a minimum action method (MAM) with optimal linear time scaling, called tMAM for short. The main idea is to relax the integration time as a functional of the transition path through optimal linear time scaling such that a direct optimization of the integration time is not required. The Feidlin-Wentzell action functional is discretized by finite elements, based on which h...
متن کاملNoncausal linear periodically time-varying scaling for discrete-time systems
A novel technique called noncausal linear periodically time-varying (LPTV) scaling was introduced recently, and it was shown that even static noncausal LPTV scaling has an ability of inducing frequency-dependent scaling if it is interpreted in the context of the conventional scaling approach. Motivated by this preceding study of ours, this paper studies to exploit this attractive property and d...
متن کاملSparsity via Linear - Time Projection
We present an efficient spectral projected-gradient algorithm for optimization subject to a group `1-norm constraint. Our approach is based on a novel linear-time algorithm for Euclidean projection onto the `1and group `1-norm constraints. Numerical experiments on large data sets suggest that the proposed method is substantially more efficient and scalable than existing methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2010
ISSN: 1367-2630
DOI: 10.1088/1367-2630/12/4/043036